Trees with maximum nullity

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integral trees with given nullity

A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only finitely many integral trees. It is also shown that integral trees with nullity 2 and 3 are unique.

متن کامل

Maximum Generic Nullity of a Graph

For a graph G of order n, the maximum nullity of G is defined to be the largest possible nullity over all real symmetric n × n matrices A whose (i, j)th entry (for i 6= j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. Maximum nullity and the related parameter minimum rank of the same set of matrices have been studied extensively. A new parameter, maximum generic nullity, is ...

متن کامل

Generic maximum nullity of a graph

For a graph G of order n, the maximum nullity of G is defined to be the largest possible nullity over all real symmetric n × n matrices A whose (i, j)th entry (for i 6= j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. Maximum nullity and the related parameter minimum rank of the same set of matrices have been studied extensively. A new parameter, generic maximum nullity, is ...

متن کامل

Minimum Rank, Maximum Nullity, and Zero Forcing of Graphs

Combinatorial matrix theory, which involves connections between linear algebra, graph theory, and combinatorics, is a vital area and dynamic area of research, with applications to fields such as biology, chemistry, economics, and computer engineering. One area generating considerable interest recently is the study of the minimum rank of matrices associated with graphs. Let F be any field. For a...

متن کامل

Ela Positive Semidefinite Maximum Nullity and Zero Forcing Number

The zero forcing number Z(G) is used to study the minimum rank/maximum nullity of the family of symmetric matrices described by a simple, undirected graph G. The positive semidefinite zero forcing number is a variant of the (standard) zero forcing number, which uses the same definition except with a different color-change rule. The positive semidefinite maximum nullity and zero forcing number f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2005

ISSN: 0024-3795

DOI: 10.1016/j.laa.2004.10.024